Stand-alone containment analysis of Phébus FPT tests with ASTEC and MELCOR codes: the FPT-2 test
نویسندگان
چکیده
منابع مشابه
Stand-alone containment analysis of Phébus FPT tests with ASTEC and MELCOR codes: the FPT-2 test
During the last 40 years, many studies have been carried out to investigate the different phenomena occurring during a Severe Accident (SA) in a Nuclear Power Plant (NPP). Such efforts have been supported by the execution of different experimental campaigns, and the integral Phébus FP tests were probably some of the most important experiments in this field. In these tests, the degradation of a ...
متن کاملSaving Critical Nodes with Firefighters is FPT
We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and firefighters can be placed on yet unburnt vertices on alternate rounds to block the fire. In this work, we consider the problem of saving a critical subset of nodes from catching ...
متن کاملMSO satisfaction is FPT on
There is a computable function f such that the problem of deciding, given a word w and an MSO sentence φ whether, S w |= φ can be decided in time O(f (l)n) where l is the length of φ and n is the length of w.
متن کاملthe analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولAn FPT Algorithm Beating 2-Approximation for k-Cut
In the k-Cut problem, we are given an edge-weighted graph G and an integer k, and have to remove a set of edges with minimum total weight so that G has at least k connected components. Prior work on this problem gives, for all h ∈ [2, k], a (2 − h/k)-approximation algorithm for k-cut that runs in time n. Hence to get a (2− ε)-approximation algorithm for some absolute constant ε, the best runtim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Heliyon
سال: 2018
ISSN: 2405-8440
DOI: 10.1016/j.heliyon.2018.e00553